Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem
Subhash Khot (New York University)
24-Aug-2020, 14:00-15:00 (5 years ago)
computational complexitydiscrete mathematicsdata structures and algorithms
Audience: advanced learners
Prague Summer School on Discrete Mathematics 2020
Series comments: Lecture series: *Subhash Khot: Hardness of Approximation: From the PCP Theorem to the 2-to-2 Games Theorem *Shayan Oveis Gharan: Polynomial Paradigm in Algorithm Design
| Organizer: | Jan Hladky* |
| *contact for this listing |
Export talk to